Thesis for the Degree of Master of Science in Computer Science with specialisation in Software Engineering AUTOMATED TEST CASE GENERATION FOR FUNCTION BLOCK DIAGRAMS USING JAVA PATH FINDER AND SYMBOLIC EXECUTION

نویسندگان

  • Sebastian Kunze
  • Daniel Sundmark
  • Adnan Causevic
چکیده

Testing Function Block Diagram (FBD) programs for safety-critical software components is of significant importance. Their failure or malfunction may result in a serious outcome and may cause severe damage. Consequently, a certain degree of certification is required to guarantee that the provided test cases cover the logical structure of the safety-critical software components. In practise, testing FBD programs is relatively hard because it is usually performed manually and is prone to human error. Recently, researchers devised an automated test generation tool named CompleteTest that aids control engineers to perform component testing. It analyses safety-critical software components to identify a number of tests needed to achieve maximum coverage required by the industry for operation. CompleteTest is based on a model checker that lacks support for Real and String types which are heavily used in FBD programs. Java Path Finder (JPF) is a model checker that supports different data types and provides an extension supporting symbolic execution named Symbolic Path Finder (SPF). To our knowledge, there has been little research on using symbolic execution in testing FBD programs. Hence, we compare JPF / SPF to CompleteTest and explore possibilities and limitations of symbolic execution on FBD program testing. We show how to translate two FBD programs to Java program representations suitable for model checking using JPF / SPF. In addition, we illustrate how to instrument those Java program representations for automated test case generation using JPF / SPF. The resulting test cases are compared to the test cases generated by CompleteTest evaluating their coverage, efficiency and effectiveness. Even though, the test cases generated by JPF / SPF turn out to be more effective and provide the same coverage as the test cases generated by CompleteTest, more work needs to be done on the efficiency of JPF / SPF optimising its search algorithm. iii

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Märlardalen University School of Innovation Design and Engineering Väster̊as, Sweden Thesis for the Degree of Master of Science in Software Engineering AUTOMATED TEST CASE GENERATION FOR FUNCTION BLOCK DIAGRAMS USING JAVA PATH FINDER AND SYMBOLIC EXECUTION

Testing Function Block Diagram (FBD) programs for safety-critical software components is of significant importance. Their failure or malfunction may result in a serious outcome and may cause severe damage. Consequently, a certain degree of certification is required to guarantee that the provided test cases cover the logical structure of the safety-critical software components. In practise, test...

متن کامل

Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk)

A crucial problem in software security is the detection of side-channels [5, 2, 7]. Information gained by observing non-functional properties of program executions (such as execution time or memory usage) can enable attackers to infer secret information (such as a password). In this talk, I will discuss how symbolic execution, combined with a model counting constraint solver, can be used for qu...

متن کامل

Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution

Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensitive relevancy analysis algorithm based on weighted pushdown model checking, which pinpoints memory locations in the program where symbolic values can flow into. This information is then utilized by a code instrumenter to trans...

متن کامل

FoREnSiC- An Automatic Debugging Environment for C Programs

We present FoREnSiC, an open source environment for automatic error detection, localization and correction in C programs. The framework implements different automated debugging methods in a unified way covering the whole design flow from ESL to RTL. Currently, a scalable simulation-based back-end, a back-end based on symbolic execution, and a formal back-end exploiting functional equivalences b...

متن کامل

Mirex 2014 Entry: Music Segmentation Techniques and Greedy Path Finder Algorithm to Discover Musical Patterns

This extended abstract describes the pattern discovery submission to MIREX 2014 of an algorithm that uses music segmentation (or music structure analysis) techniques and a refined greedy method in order to identify the repetitive musical patterns of a given music piece, either represented symbolically or with an actual audio file. We obtain a harmonic representation of the input and compute the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015